Practical joint pole construction
نویسندگان
چکیده
منابع مشابه
Practical Suffix Tree Construction
Large string datasets are common in a number of emerging text and biological database applications. Common queries over such datasets include both exact and approximate string matches. These queries can be evaluated very efficiently by using a suffix tree index on the string dataset. Although suffix trees can be constructed quickly in memory for small input datasets, constructing persistent tre...
متن کاملA Practical Distributed Universal Construction
Modern distributed systems employ atomic read-modify-write primitives to coordinate concurrent operations. Such primitives are typically built on top of a central server, or rely on an agreement protocol. Both approaches provide a universal construction, that is, a general mechanism to construct atomic and responsive objects. These two techniques are however known to be inherently costly. As a ...
متن کاملPractical Construction of Modified Hamiltonians
One of the most fruitful ways to analyze the effects of discretization error in the numerical solution of a system of differential equations is to examine the “modified equations,” which are equations that are exactly satisfied by the (approximate) discrete solution. These do not actually exist in general but rather are defined by an asymptotic expansion in powers of the discretization paramete...
متن کاملPractical Schemes for Fat-Tree Network Construction
Acknowledgments Tom Knight originally suggested the idea of using fat-tree structures as a means for scaling Transit networks. Tom Knight and Henry Minsky were invaluable for discussion and criticism of these ideas throughout the development process. Discussions with Tom Leighton, Charles Leiserson, and Alex Ishii were valuable to my understanding of the more theoretical aspects of network orga...
متن کاملPractical Construction of Metric t - Spanners ∗ Gonzalo
Let G(V,A) be a connected graph with a nonnegative cost function d : A → R. Let dG(u, v) be the cost of the cheapest path between u, v ∈ V . A tspanner of G is a subgraph G(V,E), E ⊆ A, such that ∀ u, v ∈ V, dG′(u, v) ≤ t · dG(u, v), t > 1. We focus on the metric space context, which means that A = V ×V , d is a metric, and t ≤ 2. Several algorithms to build t-spanners are known, but they do no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Institute of Electrical Engineers
سال: 1912
ISSN: 0097-2444
DOI: 10.1109/paiee.1912.6660161